WolfPath: Accelerating Iterative Traversing-Based Graph Processing Algorithms on GPU
نویسندگان
چکیده
منابع مشابه
Accelerating Large Graph Algorithms on the GPU Using CUDA
Graph algorithms are fundamental to many disciplines and application areas. Large graphs involving millions of vertices are common in scientific and engineering applications. Practical-time implementations using high-end computing resources have been reported but are accessible only to a few. Graphics Processing Units (GPUs) are fast emerging as inexpensive parallel processors due to their high...
متن کاملAccelerating Preconditioned Iterative Linear Solvers on Gpu
Linear systems are required to solve in many scientific applications and the solution of these systems often dominates the total running time. In this paper, we introduce our work on developing parallel linear solvers and preconditioners for solving large sparse linear systems using NVIDIA GPUs. We develop a new sparse matrix-vector multiplication kernel and a sparse BLAS library for GPUs. Base...
متن کاملMultipredicate Join Algorithms for Accelerating Relational Graph Processing on GPUs
Recent work has demonstrated that the use of programmable GPUs can be advantageous during relational query processing on analytical workloads. In this paper, we take a closer look at graph problems such as finding all triangles and all four-cliques of a graph. In particular, we present two different join algorithms for the GPU. The first is an implementation of Leapfrog-Triejoin (LFTJ), a recen...
متن کاملGPU-Vote: A Framework for Accelerating Voting Algorithms on GPU
Voting algorithms, such as histogram and Hough transforms, are frequently used algorithms in various domains, such as statistics and image processing. Algorithms in these domains may be accelerated using GPUs. Implementing voting algorithms efficiently on a GPU however is far from trivial due to irregularities and unpredictable memory accesses. Existing GPU implementations therefore target only...
متن کاملAccelerating Convergence of Iterative Image Restoration Algorithms
Iterative methods are often used for applications in science and engineering to solve very large scale linear systems. Efficiency of an iterative method depends on the amount of computation needed per iteration, as well as on the number of iterations needed to reconstruct the desired approximate solution. Convergence speed can be accelerated using a technique called preconditioning. Although pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel Programming
سال: 2017
ISSN: 0885-7458,1573-7640
DOI: 10.1007/s10766-017-0533-y